Special asteroidal quadruple on directed path graph non rooted path graph
نویسندگان
چکیده
منابع مشابه
Special asteroidal quadruple on directed path graph non rooted path graph
An asteroidal triple in a graph G is a set of three nonadjacent vertices such that for any two of them there exists a path between them that does not intersect the neighborhood of the third. Special asteroidal triple in a graph G is an asteroidal triple such that each pair is linked by a special connection. A special asteroidal triples play a central role in a characterization of directed path ...
متن کاملAsteroidal quadruples in non rooted path graphs
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to ...
متن کاملOn Rooted Directed Path Graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. An asteroidal quadruple is a stable set of four vertices such that any three of them is an asteroidal triple. Two non adjacent vertices are linked by a special connection if either they have a common neighbor or they are the endpoints of two vertex-dis...
متن کاملThe Path Space of a Directed Graph
We construct a locally compact Hausdorff topology on the path space of a directed graph E and identify its boundary-path space ∂E as the spectrum of a commutative C∗-subalgebra DE of C∗(E). We then show that ∂E is homeomorphic to a subset of the infinite-path space of any desingularisation F of E. Drinen and Tomforde showed that we can realise C∗(E) as a full corner of C∗(F ), and we deduce tha...
متن کاملDirected prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2013
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.10.008